Weak Head Normal Form - definitie. Wat is Weak Head Normal Form
Diclib.com
Woordenboek ChatGPT
Voer een woord of zin in in een taal naar keuze 👆
Taal:

Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT

Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:

  • hoe het woord wordt gebruikt
  • gebruiksfrequentie
  • het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
  • opties voor woordvertaling
  • Gebruiksvoorbeelden (meerdere zinnen met vertaling)
  • etymologie

Wat (wie) is Weak Head Normal Form - definitie

POTENTIAL STATE FOR A TERM IN LAMBDA CALCULUS
Beta-eta normal form; Head normal form; Beta redex

Weak Head Normal Form         
SUMMARY OF FORMAL DEFINITIONS OF LAMBDA CALCULUS
Weak head normal form
<reduction, lambda calculus> (WHNF) A lambda expression is in weak head normal form (WHNF) if it is a head normal form (HNF) or any lambda abstraction. I.e. the top level is not a redex. The term was coined by Simon Peyton Jones to make explicit the difference between head normal form (HNF) and what graph reduction systems produce in practice. A lambda abstraction with a reducible body, e.g. x . (( y . y+x) 2) is in WHNF but not HNF. To reduce this expression to HNF would require reduction of the lambda body: ( y . y+x) 2 --> 2+x Reduction to WHNF avoids the name capture problem with its need for alpha conversion of an inner lambda abstraction and so is preferred in practical graph reduction systems. The same principle is often used in strict languages such as Scheme to provide call-by-name evaluation by wrapping an expression in a lambda abstraction with no arguments: D = delay E = () . E The value of the expression is obtained by applying it to the empty argument list: force D = apply D () = apply ( () . E) () = E (1994-10-31)
Lambda calculus definition         
SUMMARY OF FORMAL DEFINITIONS OF LAMBDA CALCULUS
Weak head normal form
Lambda calculus is a formal mathematical system based on lambda abstraction and function application. Two definitions of the language are given here: a standard definition, and a definition using mathematical formulas.
Third normal form         
NORMALIZING A DATABASE DESIGN TO REDUCE THE DUPLICATION OF DATA AND ENSURE REFERENTIAL INTEGRITY
3NF; Third Normal Form; 3rd normal form
Third normal form (3NF) is a database schema design approach for relational databases which uses normalizing principles to reduce the duplication of data, avoid data anomalies, ensure referential integrity, and simplify data management. It was defined in 1971 by Edgar F.

Wikipedia

Beta normal form

In the lambda calculus, a term is in beta normal form if no beta reduction is possible. A term is in beta-eta normal form if neither a beta reduction nor an eta reduction is possible. A term is in head normal form if there is no beta-redex in head position. The normal form of a term, if one exists, is unique (as a corollary of the Church–Rosser theorem). However, a term may have more than one head normal form.